Simultaneously exploiting two formulations: An exact benders decomposition approach
نویسندگان
چکیده
منابع مشابه
Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search
Logic-based Benders decomposition (BD) extends classic BD by allowing more complex subproblems with integral variables. Metaheuristics like variable neighborhood search are becoming useful here for faster solving the subproblems’ inference duals in order to separate approximate Benders cuts. After performing such a purely heuristic BD approach, we continue by exactly verifying and possibly corr...
متن کاملExploiting skeletal structure in computer vision annotation with Benders decomposition
Many annotation problems in computer vision can be phrased as integer linear programs (ILPs). The use of standard industrial solvers does not to exploit the underlying structure of such problems e.g., the skeleton in pose estimation. The leveraging of the underlying structure in conjunction with industrial solvers promises increases in both speed and accuracy. Such structure can be exploited us...
متن کاملA new Approach Versus Benders Decomposition in Aggregate Production Planning
This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...
متن کاملLogic-Based Benders Decomposition
Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different f...
متن کاملGeneralized Benders Decomposition 1
Abs t r ac t . J . F . Benders devised a clever approach for exploiting the structure of mathematical programming problems with complicating variables (variables which, when temporarily fixed, render the remaining optimization problem considerably more tractable). For the class of problems specifically considered by Benders, fixing the values of the complicating variables reduces the given prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2020
ISSN: 0305-0548
DOI: 10.1016/j.cor.2020.105041